نتایج جستجو برای: Continuous time optimization problem

تعداد نتایج: 2907042  

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده برق و الکترونیک 1390

there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بوعلی سینا - دانشکده علوم پایه 1391

abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...

In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...

Journal: :international journal of nonlinear analysis and applications 2015
alireza bahiraie behzad abbasi farahnaz omidi nor aishah hamzah abdul hadi yaakub

this paper presents dynamic portfolio model based on the merton's optimal investment-consumption model, which combines dynamic synthetic put option using risk-free and risky assets. this paper is extended version of methodological paper published by yuan yao (2012) cite{26}. because of the long history of the development of foreign financial market, with a variety of financial derivatives, the ...

Abdul Hadi Yaakub Alireza Bahiraei, Behzad Abbasi Farahnaz Omidi Nor Aishah Hamzah

This paper presents dynamic portfolio model based on the Merton's optimal investment-consumption model, which combines dynamic synthetic put option using risk-free and risky assets. This paper is extended version of methodological paper published by Yuan Yao (2012). Because of the long history of the development of foreign financial market, with a variety of financial derivatives, the study on ...

Journal: :international journal of environmental research 2012
sh. afandizadeh n. kalantari h. rezaeestakhruie

nowadays, the environmental impact of transportation project and, especially air pollution impacts, are major concerns in evaluating transportation projects. based on this concern, beside definition of traditional objective functions like total travel time and total investment cost, different type of environmental related function is considered as objective function in urban network design. in...

Journal: :Computers & Mathematics with Applications 2012

Journal: :international journal of environmental research 0
sh. afandizadeh faculty of civil engineering, iran university of science and technology, iran n. kalantari faculty of civil engineering, iran university of science and technology, iran h. rezaeestakhruie faculty of civil engineering, sharif university, iran

nowadays, the environmental impact of transportation project and, especially air pollution impacts, are major concerns in evaluating transportation projects. based on this concern, beside definition of traditional objective functions like total travel time and total investment cost, different type of environmental related function is considered as objective function in urban network design. in ...

Journal: :CoRR 2017
Kien Trung Nguyen Huynh Duc Quoc

We address in this paper the problem of modifying both profits and costs of a fractional knapsack problem optimally such that a prespectified solution becomes an optimal solution with prespect to new parameters. This problem is called the inverse fractional knapsack problem. Concerning the l1-norm, we first prove that the problem is NP -hard. The problem can be however solved in quadratic time ...

Journal: :journal of advances in computer research 2014
hossein barghi jond adel akbarimajd nurhan gursel ozmen

trajectories generally used to describe the space and time required to perform a desired motion task for a mobile robot or manipulator system. in this paper, we considered a cubic polynomial trajectory for the problem of moving a mobile robot from its initial position to a goal position in over a continuous set of time. along the path, the robot requires to observe a certain acceleration profil...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید